Linearization of μCRL Specifications

We describe a linearization algorithm for μCRL processes, similar to the one described in [21] for a subset of the language called parallel pCRL. This algorithm finds its roots in formal language theory: the ‘grammar’ defining a process is transformed into a variant of Greibach Normal Form. Next, any such form is further reduced to linear form, i.e., to an equation that resembles a right-linear, data-parametric grammar. From the other perspective, linear specifications in μCRL resemble symbolic representations of transition systems, that can be further transformed and analyzed by many of the existing tools and techniques. We aim at proving the correctness of this linearization algorithm. To this end we use an equivalence relation on recursive specifications in μCRL that is model independent and does not involve an explicit notion of solution. 2000 Mathematics Subject Classification: 68Q10; 68Q42; 68Q65; 68Q85 2000 ACM Computing Classification System: D.2.1; D.2.4; D.3.1; D.3.3; F.3.2; I.1.1